Maximum lifetime continuous query processing in wireless sensor networks.

Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks.

A combinatorial algorithm for the maximum lifetime data gathering with aggregation problem in sensor networks.



Collaborative data gathering in wireless sensor networks using measurement co%2Doccurrence.

Accuracy vs. Lifetime Linear Sketches for Aggregate Queries in Sensor Networks.

Trading Computation %26 Precision for Energy inWireless Sensor Networks with Applications.



Accuracy vs. lifetime linear sketches for approximate aggregate range queries in sensor networks.

Topology%2DAware Placement and Role Assignment for Energy%2DEfficient Information Gathering in Sensor Networks.
Consider a network of energy--constrained wireless nodes that are capable of sensing and communication.
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
The rapid advances in processor, memory, and radio technology have enabled the development of  distributed networks of small, inexpensive nodes that are capable of sensing, computation, and wireless  communication. Sensor networks of the future are envisioned to revolutionize the paradigm of collecting  and processing information in diverse environments. However, the severe energy constraints and limited  computing resources of the sensors, present major challenges for such a vision to become a reality. We consider
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
The rapid advances in processor, memory, and radio technology have enabled the development of  distributed networks of small, inexpensive nodes that are capable of sensing, computation, and wireless  communication. Sensor networks of the future are envisioned to revolutionize the paradigm of collecting  and processing information in diverse environments. However, the severe energy constraints and limited  computing resources of the sensors, present major challenges for such a vision to become a reality. We consider
Adaptive Methods for Activity Monitoring of Streaming Data.
Activity monitoring deals with monitoring data (usually streaming data) for interesting events. It has several applications such as building an alarm or an alert system that triggers when outliers or change points are detected.
Distance Measures for Effective Clustering of ARIMA Time%2DSeries.
Many environmental and socioeconomic time--series data can be adequately modeled using Auto-Regressive Integrated Moving Average (ARIMA) models. We call such time--series ARIMA time--series. We consider the problem of clustering ARIMA time--series. We propose the use of the Linear Predictive Coding (LPC) cepstrum of time--series for clustering ARIMA time--series, by using the Euclidean distance between the LPC cepstra of two time--series as their dissimilarity measure. We demonstrate that LPC cepstral coefficients have the desired features for accurate clustering and efficient indexing of ARIMA time--series. For example, few LPC cepstral coefficients are sufficient in order to discriminate between time--series that are modeled by different ARIMA models. In fact this approach requires fewer coefficients than traditional approaches, such as DFT and DWT. The proposed distance measure can be used for measuring the similarity between different ARIMA models as well.
Steiner%2DOptimal Data Replication in Tree Networks with Storage Costs.

Modeling Moving Objects for Location Based Services.
Abstract. As prices of basic enabling equipment like smart cell phones, hand holds, wireless modems, and GPS devices continue to drop rapidly, International Data Corp (IDC) predicts that the number of wireless subscribers worldwide will soar to 1.1 billion in 2003. Spurred by the combination of expensive new location-based infrastructure and an enormous market of mobile users, companies will roll out new wireless applications to re-coop their technology investments and increase customer loyalty and switching costs. These applications are collectively called location-based services. In this position paper we outline a novel and comprehensive model for moving objects in location based services. The model is different than other models proposed in the literature in the sense that is captures the spatial, temporal, and uncertain aspects of the location of a moving object. These aspects are captured in the concept of a trajectory. We argue that the existing prevalent model in industry, point location management, has severe drawbacks, and explain why our trajectory model solves these problems. We also outline a set of operators to access the trajectories database. 1.
Optimal Placement of Replicas in Trees with Read%2C Write%2C and Storage Costs.

Strategies for maximizing seller%27s profit under unknown buyer%27s valuations.

Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays.

Maximizing Seller%27s Profit for Electronic Commerce.

On the bisection width of the transposition network.

Scheduling Tree DAGs on Parallel Architectures.

On the Power of the Linear Array Architecture for Performing Tree%2DStructured Computations.

On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols.

